Non-Separable and Planar Graphs
نویسندگان
چکیده
منابع مشابه
Non-Separable and Planar Graphs.
Introduction. In this paper the structure of graphs is studied by purely combinatorial methods. The concepts of rank and nullity are fundamental. The first part is devoted to a general study of non-separable graphs. Conditions that a graph be non-separable are given ; the decomposition of a separable graph into its non-separable parts is studied; by means of theorems on circuits of graphs, a me...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولNon-separable detachments of graphs
Let G = (V,E) be a graph and r : V → Z+. An r-detachment of G is a graph H obtained by ‘splitting’ each vertex v ∈ V into r(v) vertices, called the pieces of v in H. Every edge uv ∈ E corresponds to an edge of H connecting some piece of u to some piece of v. An r-degree specification for G is a function f on V , such that, for each vertex v ∈ V , f(v) is a partition of d(v) into r(v) positive i...
متن کاملRestricted rooted non-separable planar maps
Tutte founded the theory of enumeration of planar maps in a series of papers in the 1960s. Rooted non-separable planar maps have connections, for example, to pattern-avoiding permutations, and they are in one-to-one correspondence with the β(1, 0)-trees introduced by Cori, Jacquard and Schaeffer in 1997. In this paper we enumerate 2-face-free rooted non-separable planar maps and obtain restrict...
متن کاملNon-planar Extensions of Planar Graphs
A graph G is almost 4-connected if it is simple, 3-connected, has at least ve vertices, and V (G) cannot be partitioned into three sets A;B;C in such a way that jCj = 3, jAj 2, jBj 2, and no edge of G has one end in A and the other end in B. A graph K is a subdivision of a graph G if K is obtained from G by replacing its edges by internally disjoint nonzero length paths with the same ends, call...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1931
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.17.2.125